Advanced Computer Algebra for Determinants
نویسندگان
چکیده
We prove three conjectures concerning the evaluation of determinants, which are related to the counting of plane partitions and rhombus tilings. One of them has been posed by George Andrews in 1980, the other two are by Guoce Xin and Christian Krattenthaler. Our proofs employ computer algebra methods, namely the holonomic ansatz proposed by Doron Zeilberger and variations thereof. These variations make Zeilberger’s original approach even more powerful and allow for addressing a wider variety of determinants. Finally we present, as a challenge problem, a conjecture about a closed form evaluation of Andrews’s determinant.
منابع مشابه
Mathematical Foundations for Computer Graphics and Computer Vision
• Euclid synthetic geometry 300 BC • Descartes analytic geometry 1637 • Gauss – complex algebra 1798 • Hamilton – quaternions 1843 • Grassmann – Grasmann Algebra 1844 • Cayley – Matrix Algebra 1854 • Clifford – Clifford algebra 1878 • Gibbs – vector calculus 1881 – used today • Sylvester – determinants 1878 • Ricci – tensor calculus 1890 • Cartan – differential forms 1908 • Dirac, Pauli – spin ...
متن کاملA fast and reliable algorithm for evaluating nth order pentadiagonal determinants
In the current article we present a fast and reliable algorithm for evaluating nth order pentadiagonal determinants in linear time. It is a natural generalization of the DETGTRI algorithm [M. El-Mikkawy, A fast algorithm for evaluating nth order tri-diagonal determinants, J. Comput. Appl. Math. 166 (2004) 581–584]. The algorithm is suited for implementation using computer algebra systems (CAS) ...
متن کاملMisfortunes of a mathematicians' trio using Computer Algebra Systems: Can we trust?
Computer algebra systems are a great help for mathematical research but sometimes unexpected errors in the software can also badly affect it. As an example, we show how we have detected an error of Mathematica computing determinants of matrices of integer numbers: not only it computes the determinants wrongly, but also it produces different results if one evaluates the same determinant twice. M...
متن کاملEfficient Computation of Chebyshev Polynomials in Computer Algebra
Orthogonal polynomials can be calculated by computation of determinants, by the use of generating functions, in terms of Rodrigues formulas, by iterating recurrence equations, calculating the polynomial solutions of differential equations, through closed form representations and by other means. In computer algebra systems all these methods can be implemented. Depending on the application one mi...
متن کاملp-adic Shearlets
The field $Q_{p}$ of $p$-adic numbers is defined as the completion of the field of the rational numbers $Q$ with respect to the $p$-adic norm $|.|_{p}$. In this paper, we study the continuous and discrete $p-$adic shearlet systems on $L^{2}(Q_{p}^{2})$. We also suggest discrete $p-$adic shearlet frames. Several examples are provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1112.0647 شماره
صفحات -
تاریخ انتشار 2011